Anais Sbmf 2014 Sbmf 2014
نویسندگان
چکیده
Use Cases (UC) are a popular way of describing system behavior and UC quality impacts the overall system quality. However, they are presented in natural language, which is usually the cause of issues related to imprecision, ambiguity, and incompleteness. We present the results of an empirical study on the formalization of UCs as Graph Transformation models (GTs) with the goal of running tool-supported analyses on them and revealing possible errors. To evaluate our approach, we apply it to a set of real UC descriptions obtained from a software developer company and measured the results through metrics. The final results demonstrate that this approach can reveal real problems that could otherwise go undetected and, thus, help improve the quality of the UCs.
منابع مشابه
Production of thermostable invertases by Aspergillus caespitosus under submerged or solid state fermentation using agroindustrial residues as carbon source
The filamentous fungus Aspergillus caespitosus was a good producer of intracellular and extracellular invertases under submerged (SbmF) or solid-state fermentation (SSF), using agroindustrial residues, such as wheat bran, as carbon source. The production of extracellular enzyme under SSF at 30°C, for 72h, was enhanced using SR salt solution (1:1, w/v) to humidify the substrate. The extracellula...
متن کاملA Dynamic Logic for Every Season
This paper introduces a method to build dynamic logics with a graded semantics. The construction is parametrized by a structure to support both the spaces of truth and of the domain of computations. Possible instantiations of the method range from classical (assertional) dynamic logic to less common graded logics suitable to deal with programs whose transitional semantics exhibits fuzzy or weig...
متن کاملA Coinductive Animation of Turing Machines
We adopt corecursion and coinduction to formalize Turing Machines and their operational semantics in the proof assistant Coq. By combining the formal analysis of converging and diverging evaluations, our approach allows us to certify the implementation of the functions computed by concrete Turing Machines. Our effort may be seen as a first step towards the formal development of basic computabil...
متن کاملImproving Recall in Code Search by Indexing Similar Codes under Proper Terms
The recall of a code search engine is reduced, if feature-wise similar code fragments are not indexed under common terms. In this paper, a technique named Similarity Based Method Finder (SBMF) is proposed to alleviate this problem. The technique extracts all the methods from a source code corpus and converts these into reusable methods (i.e., program slice) through resolving data dependency. La...
متن کاملInstantiation Reduction in Iterative Parameterised Three-Valued Model Checking
Here we prove Lemma 3 from the paper Instantiation Reduction in Iterative Parameterised Three-Valued Model Checking submitted to SBMF 2015. According to our parameterisation rules defined in [1], the application of parameterisation (and parameter instantiation) only affects the values of transitions an labellings but not the state space. Thus, M (Bn) and M (Bn)(Bm) in Lemma 3 are both defined o...
متن کامل